Bootstrap Percolation on Periodic Trees
نویسندگان
چکیده
We study bootstrap percolation with the threshold parameter θ ≥ 2 and the initial probability p on infinite periodic trees that are defined as follows. Each node of a tree has degree selected from a finite predefined set of non-negative integers, and starting from a given node, called root, all nodes at the same graph distance from the root have the same degree. We show the existence of the critical threshold pf (θ) ∈ (0, 1) such that with high probability, (i) if p > pf (θ) then the periodic tree becomes fully active, while (ii) if p < pf (θ) then a periodic tree does not become fully active. We also derive a system of recurrence equations for the critical threshold pf (θ) and compute these numerically for a collection of periodic trees and various values of θ, thus extending previous results for regular (homogeneous) trees.
منابع مشابه
Existence and Region of Critical Probabilities in Bootstrap Percolation on Inhomogeneous Periodic Trees
Bootstrap percolation is a growth model inspired by cellular automata. At the initial time t = 0, the bootstrap percolation process starts from an initial random configuration of active vertices on a given graph, and proceeds deterministically so that a node becomes active at time t = 1, 2, . . . if sufficiently many of its neighbors are already active at the previous time t − 1. In the most ba...
متن کاملBootstrap percolation on Galton–Watson trees
Bootstrap percolation is a type of cellular automaton which has been used to model various physical phenomena, such as ferromagnetism. For each natural number r, the r-neighbour bootstrap process is an update rule for vertices of a graph in one of two states: ‘infected’ or ‘healthy’. In consecutive rounds, each healthy vertex with at least r infected neighbours becomes itself infected. Percolat...
متن کاملBootstrap Percolation on Infinite Trees and Non-Amenable Groups
Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has at least k occupied neighbors at a certain time step, then it becomes occupied in the next step. This process is well-studied on Z; here we investigate it o...
متن کاملSubcritical U-bootstrap Percolation Models Have Non-trivial Phase Transitions
We prove that there exist natural generalizations of the classical bootstrap percolation model on Z that have non-trivial critical probabilities, and moreover we characterize all homogeneous, local, monotone models with this property. Van Enter [28] (in the case d = r = 2) and Schonmann [25] (for all d > r > 2) proved that r-neighbour bootstrap percolation models have trivial critical probabili...
متن کاملBootstrap percolation on homogeneous trees has 2 phase transitions
We study the threshold θ bootstrap percolation model on the homogeneous tree with degree b+ 1, 2 ≤ θ ≤ b, and initial density p. It is known that there exists a nontrivial critical value for p, which we call pf , such that a) for p > pf , the final bootstrapped configuration is fully occupied for almost every initial configuration, and b) if p < pf , then for almost every initial configuration,...
متن کامل